from timeit import Timer

import sys
import math


def Problem():
    """By starting at the top of the triangle below and moving to adjacent 
    numbers on the row below, the maximum total from top to bottom is 23.

        3
        7 5
        2 4 6
        8 5 9 3
        
        That is, 3 + 7 + 4 + 9 = 23.
        
    Find the maximum total from top to bottom in triangle.txt (right click 
    and 'Save Link/Target As...'), a 15K text file containing a triangle 
    with one-hundred rows.
        
    NOTE: This is a much more difficult version of Problem 18. It is not 
    possible to try every route to solve this problem, as there are 
    2^(99) altogether! If you could check one trillion (10^(12)) routes 
    every second it would take over twenty billion years to check them 
    all. There is an efficient algorithm to solve it. ;o)
    """

    triangle = ""
    f = open("../var/triangle.txt")
    try:
        for line in f:
            triangle = triangle + line
    finally:
        f.close()
    
    
    #Get proper triangle
    print triangle
    triangle = triangle.splitlines()
    triangle = map(lambda x: x.strip().split(" "), triangle)
    triangle = map(lambda x: map(int, x), triangle)
    
  
    
    ## Calculate ##
    
    #Start with second last 
    for r in xrange(len(triangle)-2, -1, -1):
        for p in xrange(0, len(triangle[r])):
            
            if triangle[r+1][p] > triangle[r+1][p+1]:
                triangle[r][p] += triangle[r+1][p]
            else:
                triangle[r][p] += triangle[r+1][p+1]
    
        
    ans = triangle[0][0]

    
    print "Answer for Problem 67 = %s " % (ans,)




    
if __name__ == "__main__":
    t = Timer(setup='from __main__ import Problem', stmt='Problem()').timeit(1)
    print "Execution time = %0.3f seconds" %(t,)